Supporting Interleaved Plans in Learning Hierarchical Plan Libraries for Plan Recognition.
نویسندگان
چکیده
منابع مشابه
Supporting Interleaved Plans in Learning Hierarchical Plan Libraries for Plan Recognition
Most of the available plan recognition techniques are based on the use of a plan library in order to infer user’s intentions and/or strategies. Until some years ago, plan libraries were completely hand coded by human experts, which is an expensive, error prone and slow process. Besides, plan recognition systems with hand-coded plan libraries are not easily portable to new domains, and the creat...
متن کاملLearning Plan Libraries for Case-based Plan Recognition
This paper addresses the indexing and retrieval issues in the context of the case-based plan recognition. The indexing and storage mechanisms utilize the knowledge about planning situations that enable the recognizer to focus its search to a subset of the plan library containing relevant past plans. A two-level abstract indexing scheme, along with the incremental construction of the plan librar...
متن کاملPlan Recognition for Exploratory Learning Environments Using Interleaved Temporal Search
10 AI MAGAZINE Modern educational software is open ended and flexible, allowing students to build scientific models and examine properties of the models by running them and analyzing the results (Amershi and Conati 2006; Cocea, Gutierrez-Santos, and Magoulas 2008). Such exploratory learning environments (ELEs) are distinguished from more traditional e-learning systems in that students can build...
متن کاملCase-Based Plan Recognition with Incomplete Plan Libraries
ion and Indexing Although the intermediate states are very helpful when recognizing plans with incomplete plan libraries, the statespace for a given planning domain may be quite large (Kerkez and Cox, 2001). A large number of possible situations negatively affect the retrieval efficiency of the recognizer. We developed an indexing and retrieval scheme based on the concept of state abstraction t...
متن کاملMachine Learning for Plan Recognition
action subsuming make spaghetti and make fettucini (make pesto and make marinara). Edge labels like h=; 1; 2i represent between two actions a and b represent the fact that the rst argument of a is identical to the second argument of b. Computing the join of G1 and G2 then consists of nding action nodes sharing a common abstraction and identifying temporal and strcutural relations common to both...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTELIGENCIA ARTIFICIAL
سال: 2006
ISSN: 1988-3064,1137-3601
DOI: 10.4114/ia.v10i32.927